Macrostate data clustering.

نویسندگان

  • Daniel Korenblum
  • David Shalloway
چکیده

We develop an effective nonhierarchical data clustering method using an analogy to the dynamic coarse graining of a stochastic system. Analyzing the eigensystem of an interitem transition matrix identifies fuzzy clusters corresponding to the metastable macroscopic states (macrostates) of a diffusive system. A "minimum uncertainty criterion" determines the linear transformation from eigenvectors to cluster-defining window functions. Eigenspectrum gap and cluster certainty conditions identify the proper number of clusters. The physically motivated fuzzy representation and associated uncertainty analysis distinguishes macrostate clustering from spectral partitioning methods. Macrostate data clustering solves a variety of test cases that challenge other methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient uncertainty minimization for spectral macrostate data clustering

Spectral clustering, which uses the global information embedded in eigenvectors of an interitem relationship matrix, can outperform traditional approaches such as k-means and hierarchical clustering. Spectral hierarchical bipartitioning is well-understood, but spectral multipartitioning remains an interesting research topic. Korenblum and Shalloway [Phys. Rev. E 67, 056704 (2003)] used an analo...

متن کامل

Practical Uncertainty Minimization for Spectral Macrostate Data Clustering

Spectral clustering, which uses the global information embedded in eigenvectors of an inter-item relation matrix, can outperform traditional approaches such as k-means and hierarchical clustering. Spectral hierarchical bipartitioning is well-understood, but spectral multipartitioning remains an interesting research topic. Korenblum and Shalloway [Phys. Rev. E 67, 056704 (2003)] used an analogy ...

متن کامل

Entropy Concept for Paramacrosystems with Complex States

Consideration is given to macrosystems called paramacrosystems with states of finite capacity and distinguishable and undistinguishable elements with stochastic behavior. The paramacrosystems fill a gap between Fermi and Einstein macrosystems. Using the method of the generating functions, we have obtained expressions for probabilistic characteristics (distribution of the macrostate probabilitie...

متن کامل

Data Mechanics and Coupling Geometry on Binary Bipartite Networks

We quantify the notion of pattern and formalize the process of pattern discovery under the framework of binary bipartite networks. Patterns of particular focus are interrelated global interactions between clusters on its row and column axes. A binary bipartite network is built into a thermodynamic system embracing all up-and-down spin configurations defined by product-permutations on rows and c...

متن کامل

Mimicking Directed Binary Networks for Exploring Systemic Sensitivity: Is NCAA FBS a Fragile Competition System?

Can a popular real-world competition system indeed be fragile? To address this question, we represent such a system by a directed binary network. Upon observed network data, typically in a form of win-and-loss matrix, our computational developments begin with collectively extracting network’s information flows. And then we compute and discover network’s macrostate. This computable macrostate is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 67 5 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2003